Heuristics in Rostering for Call Centres

نویسندگان

  • Shane G. Henderson
  • Andrew J. Mason
چکیده

An important new feature on the business scene is the development of call centres, whereby a pool of staff is used to answer incoming calls from customers. This project develops a model that enables staffing levels to be determined to meet specified quality targets on customer wait times. Unlike most previous work, this new model explicitly considers call arrival rates that vary during the day, and exploits linkage between periods to keep staffing costs to a minimum.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Duty Rostering in Public Transport - Facing Preferences , Fairness , and Fatigue

Duty rostering problems occur in different application contexts and come in different flavors. They give rise to very large scale integer programs which typically have lots of solutions and extremely fractional LP relaxations. In such a situation, heuristics can be a viable algorithmic choice. We propose an improvement method of the Lin-Kernighan type for the solution of duty rostering problems...

متن کامل

A Tensor-based Approach to Nurse Rostering

Hyper-heuristics are high level improvement search methodologies exploring space of heuristics [4]. According to [5], hyper-heuristics can be categorized in many ways. A hyper-heuristic either selects from a set of available low level heuristics or generates new heuristics from components of existing low level heuristics to solve a problem, leading to a distinction between selection and generat...

متن کامل

A tensor based hyper-heuristic for nurse rostering

Nurse rostering is a well-known highly constrained scheduling problem requiring assignment of shifts to nurses satisfying a variety of constraints. Exact algorithms may fail to produce high quality solutions, hence (meta)heuristics are commonly preferred as solution methods which are often designed and tuned for specific (group of) problem instances. Hyper-heuristics have emerged as general sea...

متن کامل

PETRA : A Programmable Optimisation Engine and Toolbox for Personnel Rostering Applications

This paper presents a general optimisation-based rostering engine developed by the University of Auckland. This engine is designed to solve a wide range of personnel scheduling (staff rostering) problems. The engine is currently being used to roster over 700 staff at an Australian call centre and also for the rostering of 50 immigration staff at Auckland International Airport. It is being trial...

متن کامل

An Empirical Investigation on Memes, Self-generation and Nurse Rostering

In this paper, an empirical study on self-generating multimeme memetic algorithms is presented. A set of well known benchmark functions is used during the experiments. Moreover, a heuristic template is introduced for solving timetabling problems. The heuristics designed based on this template can utilize a set of constraint-based hill climbers in a cooperative manner. Two such adaptive heuristi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998